Exact Scheme Independence
نویسندگان
چکیده
Scheme independence of exact renormalization group equations, including independence of the choice of cutoff function, is shown to follow from general field redefinitions, which remains an inherent redundancy in quantum field theories. Renormalization group equations and their solutions are amenable to a simple formulation which is manifestly covariant under such a symmetry group. Notably, the kernel of the exact equations which controls the integration of modes acts as a field connection along the flow.
منابع مشابه
Exact scheme independence at two loops
We further develop an algorithmic and diagrammatic computational framework for very general exact renormalization groups, where the embedded regularisation scheme, parametrised by a general cutoff function and infinitely many higher point vertices, is left unspecified. Calculations proceed iteratively, by integrating by parts with respect to the effective cutoff, thus introducing effective prop...
متن کاملA DEMONSTRATION OF SCHEME INDEPENDENCE IN SCALAR ERGs
The standard demand for the quantum partition function to be invariant under the renormalization group transformation results in a general class of exact renormalization group equations, different in the form of the kernel. Physical quantities should not be sensitive to the particular choice of the kernel. Such scheme independence is elegantly illustrated in the scalar case by showing that, eve...
متن کاملA Sampling Method Based on LDPC Codes
Sampling is a powerful and popular way to tackle problems for which exact inference is computationally intractable. We propose a novel sampling scheme based on Low Density Parity Check (LDPC) codes which works for any distribution over a finite alphabet. Compared to existing methods such as Markov Chain Monte Carlo (MCMC) Methods, the proposed scheme offers a different trade-off among various f...
متن کاملOn Independence Domination
Let G be a graph. The independence-domination number γ(G) is the maximum over all independent sets I in G of the minimal number of vertices needed to dominate I. In this paper we investigate the computational complexity of γ(G) for graphs in several graph classes related to cographs. We present an exact exponential algorithm. We also present a PTAS for planar graphs.
متن کاملA Successive Numerical Scheme for Some Classes of Volterra-Fredholm Integral Equations
In this paper, a reliable iterative approach, for solving a wide range of linear and nonlinear Volterra-Fredholm integral equations is established. First the approach considers a discretized form of the integral terms where considering some conditions on the kernel of the integral equation it is proved that solution of the discretized form converges to the exact solution of the problem. Then th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000